Approximation Technique of Finite Capacity Queuing Networks Exploiting Petri Net Analysis
نویسندگان
چکیده
In this paper we present a technique for deriving approximate measures for finite capacity queuing networks. The fact that buffers have finite capacity makes the analysis of such networks very difficult. Indeed, FC-QNs do not have a product form solution, except for a limited number of special cases. In general exact solution for such models can only be obtained using numerical methods. However these techniques can only handle networks of very small size. For this reason analyses based on approximate techniques represent an interesting possibility to compute measures for queuing network models with finite capacity. In this paper we present an approximation technique that is inspired to the method called Response Time Preservation. The developing of the proposed technique is based on a representation of FC-QNs by means of Generalized Stochastic Petri Nets.
منابع مشابه
Estimation of mean response time of multi-agent systems
The following analytical approaches: queuing network models, stochastic automata networks, stochastic timed Petri nets, stochastic process algebra, Markov chains can be used in performance evaluation of multi–agent systems. In this paper, new approach which is based on PERT networks is presented. This approach is applied in performance evaluation of layered multi–agent system. Time-out mechanis...
متن کاملStochastic Petri Net Models of Polling Systems
We consider finite-population and finite-capacity polling systems. The behavior of these systems is described by means of generalized stochastic Petri nets. The exact results for the mean response times are obtained numerically by means of the stochastic Petri net package. Finite population polling systems are generally difficult to analyze. Thus, one of the contributions of this paper is the f...
متن کاملExpansions for Joint Laplace Transform of Stationary Waiting Times in (max, +)-linear Systems with Poisson Input
We give a Taylor series expansion for the joint Laplace transform of stationary waiting times in open (max,+)-linear stochastic systems with Poisson input. Probabilistic expressions are derived for coefficients of all orders. Even though the computation of these coefficients can be hard for certain systems, it is sufficient to compute only a few coefficients to obtain good approximations (espec...
متن کاملEfficient approximate transient analysis for a class of deterministic and stochastic Petri nets
Transient analysis of non-Markovian Stochastic Petri nets is a theoretically interesting and practically important problem. We present a new method to compute bounds and an approximation on the average state sojourn times for a special class of deterministic and stochastic Petri nets (DSPNs). In addition to the idea of the subordinated Markov chain traditionally used for the stationary solution...
متن کاملMQNA - Markovian Queueing Networks Analyser
This paper describes the MQNA Markovian Queueing Networks Analyser, a software tool to model and obtain the stationary solution of a large class of Queueing Networks. MQNA can directly solve open and closed product-form queueing networks using classical algorithms. For finite capacity queueing models, MQNA generates Markovian description in the Stochastic Automata Networks (SAN) and Stochastic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001